A Dense Set of Operators with Tiny Commutants
نویسندگان
چکیده
منابع مشابه
Lifting strong commutants of unbounded subnormal operators
Various theorems on lifting strong commutants of unbounded sub-normal (as well as formally subnormal) operators are proved. It is shown that the strong symmetric commutant of a closed symmetric operator S lifts to the strong commutant of some tight selfadjoint extension of S. Strong symmetric commutants of orthogonal sums of subnormal operators are investigated. Examples of (unbounded) irreduci...
متن کاملThe Commutants of Certain Toeplitz Operators on Weighted Bergman Spaces
For α > −1, let A2α be the corresponding weighted Bergman space of the unit ball in C. For a bounded measurable function f , let Tf be the Toeplitz operator with symbol f on A 2 α. This paper describes all the functions f for which Tf commutes with a given Tg, where g(z) = z1 1 · · · z Ln n for strictly positive integers L1, . . . , Ln, or g(z) = |z1| s1 · · · |zn| nh(|z|) for non-negative real...
متن کاملSurvey with Commutants in View
The theory of product systems both of Hilbert spaces (Arveson systems) and product systems of Hilbert modules has reached a status where it seems appropriate to rest a moment and to have a look at what is known so far and what are open problems. However, the attempt to give an approximately complete account in view pages is destined to fail already for Arveson systems since Tsirelson, Powers an...
متن کاملSome Schrödinger Operators with Dense Point Spectrum
Given any sequence {En}n−1 of positive energies and any monotone function g(r) on (0,∞) with g(0) = 1, lim r→∞ g(r) = ∞, we can find a potential V (x) on (−∞,∞) so that {En}n=1 are eigenvalues of − d 2 dx2 + V (x) and |V (x)| ≤ (|x| + 1)−1g(|x|). In [7], Naboko proved the following: Theorem 1. Let {κn}∞n=1 be a sequence of rationally independent positive reals. Let g(r) be a monotone function o...
متن کاملDominance Constraints with Set Operators
Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by admitting set operators. We present a solver for dominance constraints with set operators, which is based on propagation and distribution rules, and prove its soundness and completeness. From this solver, we derive an implement...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1991
ISSN: 0002-9947
DOI: 10.2307/2001838